Fine-Grained Time Complexity of Constraint Satisfaction Problems
نویسندگان
چکیده
We study the constraint satisfaction problem (CSP) parameterized by a language Γ (CSPΓ) and how choice of affects its worst-case time complexity. Under exponential-time hypothesis (ETH), we rule out existence subexponential algorithms for finite-domain NP-complete CSPΓ problems. This extends to certain infinite-domain CSPs structurally restricted For with finite domain D where all unary relations are available, identify relation S such that complexity CSP({ }) is lower bound this kind. also prove strictly decreases when |D| increases (unless ETH false) provide stronger results in special case |D|=3.
منابع مشابه
The complexity of recursive constraint satisfaction problems
We investigate the complexity of finding solutions to infinite recursive constraint satisfaction problems. We show that, in general, the problem of finding a solution to an infinite recursive constraint satisfaction problem is equivalent to the problem of finding an infinite path through a recursive tree. We also identify natural classes of infinite recursive constraint problems where the probl...
متن کاملThe Optimization Complexity of Constraint Satisfaction Problems
In 1978, Schaefer [12] considered a subclass of languages in NP and proved a “dichotomy theorem” for this class. The subclass considered were problems expressible as “constraint satisfaction problems”, and the “dichotomy theorem” showed that every language in this class is either in P, or is NP-hard. This result is in sharp contrast to a result of Ladner [9], which shows that such a dichotomy d...
متن کاملThe Complexity of Constraint Satisfaction Problems∗
The tractability conjecture for constraint satisfaction problems (CSPs) describes the constraint languages over a finite domain whose CSP can be solved in polynomial-time. The precise formulation of the conjecture uses basic notions from universal algebra. In this talk, we give a short introduction to the universal-algebraic approach to the study of the complexity of CSPs. Finally, we discuss a...
متن کاملA fine-grained arc-consistency algorithm for non-normalized constraint satisfaction problems
Constraint programming is a powerful software technology for solving numerous real-life problems. Many of these problems can be modeled as Constraint Satisfaction Problems (CSPs) and solved using constraint programming techniques. However, solving a CSP is NP-complete so filtering techniques to reduce the search space are still necessary. Arcconsistency algorithms are widely used to prune the s...
متن کاملComplexity results for boolean constraint satisfaction problems
My thesis is concerned with Boolean constraint satisfaction problems (CSP). A constraint consists of a set of variables and a (Boolean) relation, which restricts the assignment of certain tuples of variables. A CSP then is the question, whether there is an assignment for all variables to a given set of constraints, such that all constraints are satisfied simultaneously. We examine this CSP and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Computation Theory
سال: 2021
ISSN: ['1942-3454', '1942-3462']
DOI: https://doi.org/10.1145/3434387